Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study
نویسندگان
چکیده
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملCuckoo search via Lévy flights for the capacitated vehicle routing problem
For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...
متن کاملCuckoo Search Algorithm for Capacitated Vehicle Routing Problem
The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...
متن کاملAccelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing on local search, the most time-consuming component. This paper describes the application of two acceleration techniques to local search in a memetic algorithm: caching of values of objective function for neighbours an...
متن کاملHeuristic Methods for Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of RAS
سال: 2019
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2019-31(4)-8